Strong Equivalence of RASP Programs
نویسندگان
چکیده
RASP is a recent extension of Answer Set Programming that permits declarative specification and reasoning on consumption and production of resources. In this paper, we extend the concept of strong equivalence (which, as widely recognized, provides an important conceptual and practical tool for program simplification, transformation and optimization) from ASP to RASP programs and discuss its usefulness in
منابع مشابه
RASP and ASP as a fragment of linear logic
RASP is a recent extension to Answer Set Programming (ASP) that permits declarative specification and reasoning on consumption and production of resources. ASP can be seen as a particular case of RASP. In this paper, we study the relationship between linear logic and RASP problem specification. We prove that RASP programs can be translated into (a fragment of) linear logic, and vice versa. In d...
متن کاملStrong equivalence made easy: nested expressions and weight constraints
Logic programs P and Q are strongly equivalent if, given any program R, programs P ∪R and Q ∪R are equivalent (that is, have the same answer sets). Strong equivalence is convenient for the study of equivalent transformations of logic programs: one can prove that a local change is correct without considering the whole program. Lifschitz, Pearce and Valverde showed that Heyting’s logic of here-an...
متن کاملVenus Analog Testbed for Rasp and Sample Acquisition Testing
Introduction: Similar in size Venus has been called Earth’s sister planet. However with an atmospheric pressure of 90bar and surface temperatures exceeding 460oC, the conditions on the surface of Venus are some of the most extreme in the solar system. Our desire to go to learn more about our neighboring planet is pushing the envelope for sample handling technologies. The Venusian environment is...
متن کاملStrong Equivalence for Logic Programs with Preferences
Recently, strong equivalence for Answer Set Programming has been studied intensively, and was shown to be beneficial for modular programming and automated optimization. In this paper we define the novel notion of strong equivalence for logic programs with preferences. Based on this definition we give, for several semantics for preference handling, necessary and sufficient conditions for program...
متن کاملWeak Order Equivalence for Logic Programs with Preferences
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimization. In [9], the novel notion of strong equivalence for logic programs with rule preferences (so-called ordered logic programs) has been defined and necessary and sufficient conditions for programs being strongly equiv...
متن کامل